An Adaptive Local Grid Refinement Method for Nonlinear Filtering
نویسندگان
چکیده
Numerical solution of the Zakai equation usually leads to large systems of equations which have to be solved at each time step. An algorithm for the numerical approximation of the Zakai equation is presented, based on discretization schemes provided by Kushner, and by LeGland. We use an a posteriori criterion based on truncation error, to localize reenement regions. We apply the fast adaptive composite grid (FAC) method introduced by McCormick for solving the resulting linear systems. Numerical tests are presented, which show the eeciency of the FAC method. Une M ethode de Raanement Local de Maillage pour le Filtrage Non{Lin eaire R esum e : La r esolution num erique de l' equation de Zakai conduit g en eralement a des syst emes d' equations qui doivent ^ etre invers es a chaque pas de temps. Un algorithme pour l'approximation num erique de l' equation de Zakai est pr esent e, qui repose sur des sch emas de discr etisation propos es par Kushner, et par LeGland. Nous utilisons un crit ere a posteriori fond e sur l'erreur de troncature, pour d eterminer les r egions a raaner. Nous appliquons la m ethode FAC (Fast Adaptive Composite) introduite par McCormick pour r esoudre le syst eme lin eaire obtenu. Des tests num eriques sont pr esent es, qui montrent l'eecacit e de la m ethode FAC.
منابع مشابه
A hybrid sparse-grid approach for nonlinear filtering problems based on adaptive-domain of the Zakai equation approximations
A hybrid finite difference algorithm for the Zakai equation is constructed to solve nonlinear filtering problems. The algorithm combines the splitting-up finite difference scheme and hierarchical sparse grid method to solve moderately high dimensional nonlinear filtering problems. When applying hierarchical sparse grid method to approximate bell-shaped solutions in most applications of nonlinea...
متن کاملImplicit adaptive mesh refinement for 2D reduced resistive magnetohydrodynamics
An implicit structured-adaptive-mesh-refinement (SAMR) solver for 2D reduced magnetohydrodynamics (MHD) is described. The time-implicit discretization is able to step over fast normal modes, while the spatial adaptivity resolves thin, dynamically evolving features. A Jacobian-free Newton-Krylov method is used for the nonlinear solver engine. For preconditioning, we have extended the optimal “ph...
متن کاملAdaptive Grid Use in Air Quality Modeling
The predictions from air quality models are subject to many sources of uncertainty; among them, grid resolution has been viewed as one that is limited by the availability of computational resources. A large grid size can lead to unacceptable errors for many pollutants formed via nonlinear chemical reactions. Further, insufficient grid resolution limits the ability to perform accurate exposure a...
متن کاملParallel Adaptive Mesh Refinement for Electronic Structure Calculations
We have applied structured adaptive mesh refinement techniques to the solution of the LDA equations for electronic structure calculations. Local spatial refinement concentrates memory resources and numerical effort where it is most needed, near the atomic centersand in regions of rapidly varying charge density. The structured grid representation enables us to employ efficient iterative solver t...
متن کاملA two-dimensional moving finite element method with local refinement based on a posteriori error estimates
In this paper, we consider the numerical solution of time-dependent PDEs using a finite element method based upon rh-adaptivity. An adaptive horizontal method of lines strategy equipped with a posteriori error estimates to control the discretization through variable time steps and spatial grid adaptations is used. Our approach combines an r-refinement method based upon solving so-called moving ...
متن کامل